Strongly Rational Sets for Normal-Form Games
نویسندگان
چکیده
Curb sets [Basu and Weibull, Econ. Letters 36 (1991), 141-146] are product sets of pure strategies containing all individual best-responses against beliefs restricted to the recommendations to the remaining players. The concept of minimal curb sets is a set-theoretic coarsening of the notion of strict Nash equilibrium. We introduce the concept of minimal strong curb sets which is a set-theoretic coarsening of the notion of strong Nash equilibrium. Strong curb sets are product sets of pure strategies such that each player's set of recommended strategies must contain all coalitional best-responses of each coalition to whatever belief each coalition member may have that is consistent with the recommendations to the other players. Minimal strong curb sets are shown to exist and are compared with other well known solution concepts. We also provide a dynamic learning process leading the players to playing strategies from a minimal strong curb set.
منابع مشابه
An Approach to Cooperation in General-Sum Normal Form Games
My primary research interest is social behavior for software agents to achieve cooperation in general-sum normal form games. An agent can easily be programmed to constantly cooperate in a normal form game, but such an agent is not suitable for environments with potentially hostile opponents. For a rational agent, the main reason to cooperate is to induce reciprocation therefore it is necessary ...
متن کاملLattice Point Methods for Combinatorial Games
We encode arbitrary finite impartial combinatorial games in terms of lattice points in rational convex polyhedra. Encodings provided by these lattice games can be made particularly efficient for octal games, which we generalize to squarefree games. These additionally encompass all heap games in a natural setting, in which the Sprague–Grundy theorem for normal play manifests itself geometrically...
متن کاملAlgorithms for Closed Under Rational Behavior (CURB) Sets
We provide a series of algorithms demonstrating that solutions according to the fundamental game-theoretic solution concept of closed under rational behavior (CURB) sets in two-player, normal-form games can be computed in polynomial time (we also discuss extensions to n-player games). First, we describe an algorithm that identifies all of a player’s best responses conditioned on the belief that...
متن کاملEmpirical Tests of Equilibrium Selection Based on Player Heterogeneity
We develop and test a model of initial play for symmetric normal-form games with multiple Nash equilibria. First, we specify an encompassing model that incorporates both equilibrium selection principles and boundedly rational behavioral models. We then design experimental games that can identify a variety of equilibrium selection principles. Model comparisons and hypothesis tests indicate that:...
متن کاملAn Algebraic Approach for Computing Equilibria of a Subclass of Finite Normal Form Games
A Nash equilibrium has become important solution concept for analyzing the decision making in Game theory. In this paper, we consider the problem of computing Nash equilibria of a subclass of generic finite normal form games. We define rational payoff irrational equilibria games to be the games with all rational payoffs and all irrational equilibria. We present a purely algebraic method for com...
متن کامل